Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume
نویسندگان
چکیده
A Fary grid drawing of a graph is a drawing on a three-dimensional grid such that vertices are placed at integer coordinates and edges are straight-lines such that no edge crossings are allowed. In this paper it is proved that each k-colorable graph (k 2) needs at least (n 3=2) volume to be drawn. Furthermore, it is shown how to draw 2-, 3-and 4-colorable graphs in a Fary grid fashion in O(n 2) volume.
منابع مشابه
Three-dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer points so that the straight-line segments representing the edges of G are pairwise non-crossing. It is shown that for any xed r 2, every r-colorable graph of n vertices has a three-dimensional grid drawing that ts into a box of volume O(n2). The order of magnitude of this bound cannot be improved.
متن کاملA simple algorithm for 4-coloring 3-colorable planar graphs
Graph coloring for 3-colorable graphs receives very much attention by many researchers in theoretical computer science. Deciding 3-colorability of a graph is a well-known NP-complete problem. So far, the best known polynomial approximation algorithm achieves a factor of O(n0.2072), and there is a strong evidence that there would be no polynomial time algorithm to color 3-colorable graphs using ...
متن کاملPath-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
Straight-Line Grid Drawings of Graphs ? Vida Dujmović1, Pat Morin2, and David R. Wood2 1 School of Computer Science, McGill University, Montréal, Canada. E-mail: vida s.m gill. a 2 School of Computer Science, Carleton University, Ottawa, Canada. E-mail: fmorin,davidwg s s. arleton. a Abstract. We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line grid ...
متن کاملColoring 3-colorable graphs with o(n^{1/5}) colors
Recognizing 3-colorable graphs is one of the most famous NP-complete problems [Garey, Johnson, and Stockmeyer STOC’74]. The problem of coloring 3-colorable graphs in polynomial time with as few colors as possible has been intensively studied: O(n1/2) colors [Wigderson STOC’82], Õ(n2/5) colors [Blum STOC’89], Õ(n3/8) colors [Blum FOCS’90], O(n1/4) colors [Karger, Motwani, Sudan FOCS’94], Õ(n3/14...
متن کاملThree-Dimensional Grid Drawings with Sub-quadratic Volume
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges are pairwise non-crossing. A O(n3/2) volume bound is proved for three-dimensional grid drawings of graphs with bounded degree, graphs with bounded genus, and graphs with no bounded complete graph as a minor. The previ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996